The Cycle-Complete Graph Ramsey Numbers
نویسنده
چکیده
In 1978 Erdős, Faudree, Rousseau, and Schelp conjectured that r (Cp, Kr) = (p − 1) (r − 1) + 1. for every p ≥ r ≥ 3, except for p = q = 3. This has been proved for r ≤ 6, and for p ≥ r 2 − 2r. In this note we prove the conjecture for p ≥ 4r + 2.
منابع مشابه
On cycle - Complete graph ramsey numbers
A new upper bound is given for the cycle-complete graph Ramsey number r(C,,,, K„), the smallest order for a graph which forces it to contain either a cycle of order m or a set of ri independent vertices . Then, another cycle-complete graph Ramsey number is studied, namely r( :C,,,, K„) the smallest order for a graph which forces it to contain either a cycle of order 1 for some I satisfying 3 :1...
متن کاملPlanar Ramsey Numbers for Small Graphs
Given two graphs G1 and G2, the planar Ramsey number PR(G1, G2) is the smallest integer n such that every planar graph on n vertices either contains a copy of G1 or its complement contains a copy of G2. So far, the planar Ramsey numbers have been determined, when both, G1 and G2 are complete graphs or both are cycles. By combining computer search with some theoretical results, in this paper we ...
متن کاملAll Ramsey (2K2,C4)−Minimal Graphs
Let F, G and H be non-empty graphs. The notation F → (G,H) means that if any edge of F is colored by red or blue, then either the red subgraph of F con- tains a graph G or the blue subgraph of F contains a graph H. A graph F (without isolated vertices) is called a Ramsey (G,H)−minimal if F → (G,H) and for every e ∈ E(F), (F − e) 9 (G,H). The set of all Ramsey (G,H)−minimal graphs is denoted by ...
متن کاملA Note on Odd Cycle-Complete Graph Ramsey Numbers
The Ramsey number r(Cl,Kn) is the smallest positive integer m such that every graph of order m contains either cycle of length l or a set of n independent vertices. In this short note we slightly improve the best known upper bound on r(Cl,Kn) for odd l.
متن کاملAll cycle-complete graph Ramsey numbers r(Cm, K6)
The cycle-complete graph Ramsey number r (Cm,Kn ) is the smallest integer N such that every graph G of order N contains a cycle Cm on m vertices or has independence number (G) n. It has been conjectured by Erdős, Faudree, Rousseau and Schelp that r (Cm,Kn )1⁄4 (m 1) (n 1)þ 1 for all m n 3 (except r (C3,K3 )1⁄4 6). This conjecture holds for 3 n 5: In this paper we will present a proof for n 1⁄4 ...
متن کاملMulticolor Ramsey Numbers for Paths and Cycles
For given graphs G1, G2, . . . , Gk, k ≥ 2, the multicolor Ramsey number R(G1, G2, . . . , Gk) is the smallest integer n such that if we arbitrarily color the edges of the complete graph on n vertices with k colors, then it is always a monochromatic copy of some Gi, for 1 ≤ i ≤ k. We give a lower bound for k-color Ramsey number R(Cm, Cm, . . . , Cm), where m ≥ 8 is even and Cm is the cycle on m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Combinatorics, Probability & Computing
دوره 14 شماره
صفحات -
تاریخ انتشار 2005